Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories

We present decidability results for termination of classes of term rewriting systems modulo permutative theories. Termination and innermost termination modulo permutative theories are shown to be decidable for term rewrite systems (TRS) whose right-hand side terms are restricted to be shallow (variables occur at depth at most one) and linear (each variable occurs at most once). Innermost termination modulo permutative theories is also shown to be decidable for shallow TRS. We first show that a shallow TRS can be transformed into a flat (only variables and constants occur at depth one) TRS while preserving termination and innermost termination. The decidability results are then proved by showing that (a) for right-flat right-linear (flat) TRS, non-termination (respectively, innermost non-termination) implies non-termination starting from flat terms, and (b) for right-flat TRS, the existence of non-terminating derivations starting from a given term is decidable. On the negative side, we show PSPACE-hardness of termination and innermost termination for shallow right-linear TRS, and undecidability of termination for flat TRS.Comment: 20 page

Development of ultrasonic motor with a coil type stator and its application to vascular endoscope

IVUS (Intravascular Ultrasound) is a useful medical device to observe the thrombus in blood vessels, and such a micro motor less than 1.0 mm in outer diameter is desired to apply IVUS in narrow brain vessels. In our previous works, ultrasonic motor consisting of a wire coil type stator, a waveguide, a cylindrical rotor, an ultrasonic vibrator has been developed. This motor is rather easy to miniaturize because of its simple structure. However, this motor behavior is unstable rotate. To improve these problems, a foil type stator has been applied in stead of a wire coiled stator. An ultrasonic motor with 0.05 mm thick foil type stator was manufactured and tested their performances. It was able to verify that this ultrasonic motor with a foil type stator has the right quality. So, simplified IVUS system using ultrasonic motor with a foil type stator was manufactured and tested their fundamental performances. In order to expand development of new application, ultrasonic motor with a shortened waveguide and ultrasonic motor integrated driving unit with a stator was developed

Dirac's hole theory versus quantum field theory

Dirac's hole theory and quantum field theory are usually considered equivalent to each other. For models of a certain type, however, the equivalence may not hold as we discuss in this Letter. This problem is closely related to the validity of the Pauli principle in intermediate states of perturbation theory.Comment: No figure

Guided Unfoldings for Finding Loops in Standard Term Rewriting

In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding process, using distinguished positions in the rewrite rules. This results in a depth-first computation of the unfoldings, whereas the original technique was breadth-first. We have implemented this new approach in our tool NTI and compared it to the previous one on a bunch of rewrite systems. The results we get are promising (better times, more successful proofs).Comment: Pre-proceedings paper presented at the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Frankfurt am Main, Germany, 4-6 September 2018 (arXiv:1808.03326

A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems

We give a method to prove confluence of term rewriting systems that contain non-terminating rewrite rules such as commutativity and associativity. Usually, confluence of term rewriting systems containing such rules is proved by treating them as equational term rewriting systems and considering E-critical pairs and/or termination modulo E. In contrast, our method is based solely on usual critical pairs and it also (partially) works even if the system is not terminating modulo E. We first present confluence criteria for term rewriting systems whose rewrite rules can be partitioned into a terminating part and a possibly non-terminating part. We then give a reduction-preserving completion procedure so that the applicability of the criteria is enhanced. In contrast to the well-known Knuth-Bendix completion procedure which preserves the equivalence relation of the system, our completion procedure preserves the reduction relation of the system, by which confluence of the original system is inferred from that of the completed system